A multicast tree aggregation algorithm in wavelength-routed WDM networks
نویسندگان
چکیده
Wavelength division multiplexing (WDM) has been considered a promising transmission technology in optical communication networks. With the continuous advance in optical technology, WDM network will play an important role in wide area backbone networks. Optical wavelength switching, compared with optical packet switching, is a more mature and more cost-effective choice for optical switching technologies. Besides, the technology of time division multiplexing in optical communication networks has been working smoothly for a long time. In the proposed research, the problem of multicast groups aggregation and multicast routing and wavelength assignment in wavelength-routed WDM network is studied. The optical cross connect switches in the problem are assumed to have limited optical multicast/splitting and TDM functionalities. Given the physical network topology and capacity, the objective is to maximize the total revenue by means of utmost merging multicast groups into larger macro-groups. The groups in the same macro-group will share a multicast tree to conduct data transmission. The problem is formulated as an optimization problem, where the objective function is to maximize the total revenue subject to capacity constraints of components in the optical network, wavelength continuity constraints, and tree topology constraints. The decision variables in the formulations include the merging results between groups, multicast tree routing assignment and wavelength assignment. The basic approach to the algorithm development for this model is Lagrangean relaxation in conjunction with a number of optimization techniques. In computational experiments, the proposed algorithms are evaluated on different network topologies and perform efficiently and effectively according to the experiment results.
منابع مشابه
Optimized Dynamic Traffic Grooming for Multicast Traffic in Optical WDM Networks
The dynamic traffic-grooming problem in wavelength routed networks is generally a two-layered routing problem in which traffic connections are routed over light paths in the virtual topology layer and light paths are routed over physical links in the physical topology layer. Traffic grooming for multicast communication in WDM networks has received very little attention to date. In this paper, w...
متن کاملAll-Optical Multicast Routing in Wavelength Routed WDM Networks. (Routage multicast tout optique dans les réseaux WDM)
In this thesis, we studied the all-optical multicast routing (AOMR) problem in wavelength-routed WDM networks. The objective is to find a set of light structures, for instance a light-tree or a light-forest, to distribute the multicast messages to all the destinations concurrently while either taking account of both the end-to-end delay and the link stress or minimizing the total cost or the po...
متن کاملDesign of Light-Tree Based Logical Topologies for Multicast Streams in Wavelength Routed Optical Networks
In this paper, we formulate an optimization problem for the design of light-tree based logical topology in Wavelength Division Multiplexing (WDM) networks. The problem is comprised of two parts: (1) multicast routing and wavelength assignment of light-trees, and (2) the design of light-tree based logical topology for multicast streams. In the first part, we use Mixed Integer Linear Programming ...
متن کاملEfficient Multiple Multicast in WDM Networks
This paper addresses the problem of multiple multicast in WDM networks. It presents three efficient algorithms to construct an optimal/sub-optimal multicast tree for each multicast and minimise the network congestion on wavelengths. The first two algorithm achieve an optimal network congestion for a specific class of networks whose all wavelengths are globally accessible and convertible at a un...
متن کاملPerformance Assessment of MC Placement for Multicast Routing in WDM Networks with Spare Light Splitting
This investigation examines all-optical multicast routing in wavelength-routed optical networks with sparse Multicast Capable (MC) nodes that have three phases. The first phase is the MC node placement, and the maximum path count first (MPCF) algorithm is utilized to obtain candidates for MC nodes. The second phase is a multicast routing with MC-based schemes which including two algorithms, nam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005